Abstract Interpretation of Probabilistic Semantics
نویسنده
چکیده
interpretation of probabilistic semantics
منابع مشابه
Probabilistic Abstract Interpretation
Abstract interpretation has been widely used for verifying properties of computer systems. Here, we present a way to extend this framework to the case of probabilistic systems. The probabilistic abstraction framework that we propose allows us to systematically lift any classical analysis or verification method to the probabilistic setting by separating in the program semantics the probabilistic...
متن کاملProbabilistic Semantics and Program Analysis
The aims of these lecture notes are two-fold: (i) we investigate the relation between the operational semantics of probabilistic programming languages and Discrete Time Markov Chains (DTMCs), and (ii) we present a framework for probabilistic program analysis which is inspired by the classical Abstract Interpretation framework by Cousot & Cousot and which we introduced as Probabilistic Abstract ...
متن کاملProbabilistic λ-calculus and Quantitative Program Analysis
We show how the framework of probabilistic abstract interpretation can be applied to statically analyse a probabilistic version of the λ-calculus. The resulting analysis allows for a more speculative use of its outcomes based on the consideration of statistically defined quantities. After introducing a linear operator based semantics for our probabilistic λ-calculus ΛP , and reviewing the frame...
متن کاملForgetting causality in the concurrent game semantics of probabilistic PCF
We enrich thin concurrent games with symmetry, recently introduced by Castellan et al, with probabilities, and build on top of it a cartesian closed category with an interpretation of Probabilistic PCF (PPCF). Exploiting that the strategies obtained from PPCF terms have a deadlock-free interaction, we deduce that there is a functor preserving the interpretation from our games to the probabilist...
متن کاملQuantitative Relations and Approximate Process Equivalences
We introduce a characterisation of probabilistic transition systems (PTS) in terms of linear operators on some suitably defined vector space representing the set of states. Various notions of process equivalences can then be re-formulated as abstract linear operators related to the concrete PTS semantics via a probabilistic abstract interpretation. These process equivalences can be turned into ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000